翻訳と辞書 |
Exact algorithm : ウィキペディア英語版 | Exact algorithm In computer science and operations research, exact algorithms are algorithms that always solve an optimization problem to optimality. Unless P = NP, such an algorithm cannot run in worst-case polynomial time but there has been extensive research on finding exact algorithms whose running time is exponential with a low base.〔.〕 == See also ==
* Approximation-preserving reduction * APX is the class of problems with some constant-factor approximation algorithm * PTAS - a type of approximation algorithm that takes the approximation ratio as a parameter
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Exact algorithm」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|